Linear tree codes and the problem of explicit constructions
نویسنده
چکیده
We reduce the problem of constructing asymptotically good tree codes to the construction of triangular totally nonsingular matrices over fields with polynomially many elements. We show a connection of this problem to Birkhoff interpolation in finite fields. 2010 Mathematics Subject Classification: 94B60, 15B99
منابع مشابه
Error Correcting Codes for Distributed Control
The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in applications of networked control systems. Although the work of Schulman and Sahai over the past two decades, and their development of the notions of “tree codes” and “anytime capacity”, provides the theoretical framework for studying such problems, there has been scant p...
متن کاملCapacity Achieving Codes From Randomness Condensers
We give a general framework for construction of small ensembles of capacity achieving linear codes for a wide range of (not necessarily memoryless) discrete symmetric channels, and in particular, the binary erasure and symmetric channels. The main tool used in our constructions is the notion of randomness extractors and lossless condensers that are regarded as central tools in theoretical compu...
متن کاملExplicit Constructions and Bounds for Batch Codes with Restricted Size of Reconstruction Sets
Abstract. Linear batch codes and codes for private information retrieval (PIR) with a query size t and a restricted size r of the reconstruction sets are studied. New bounds on the parameters of such codes are derived for small values of t or r by providing corresponding constructions. By building on the ideas of Cadambe and Mazumdar, a new bound in a recursive form is derived for batch codes a...
متن کاملLinear-Time Encodable Error-Correcting Codes Decodable
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmicdepth circuits of l inear size and decoded by logarithmic depth circuits of size O(n log n). W e present both randomized and explicit constructions of these codes. a generator matrix. The second complexity is the time it...
متن کاملA NEW APPROACH TO THE SOLUTION OF SENSITIVITY MINIMIZATION IN LINEAR STATE FEEDBACK CONTROL
In this paper, it is shown that by exploiting the explicit parametric state feedback solution, it is feasible to obtain the ultimate solution to minimum sensitivity problem. A numerical algorithm for construction of a robust state feedback in eigenvalue assignment problem for a controllable linear system is presented. By using a generalized parametric vector companion form, the problem of eigen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1310.5684 شماره
صفحات -
تاریخ انتشار 2013